Closed Freyd- and -categories
نویسندگان
چکیده
We give two classes of sound and complete models for the computational-calculus, or c-calculus. For the rst, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational-calculus. The latter corresponds to an idealisation of stack-based intermediate languages used in some approaches to compiling.
منابع مشابه
Freyd categories are Enriched Lawvere Theories
Lawvere theories provide a categorical formulation of the algebraic theories from universal algebra. Freyd categories are categorical models of first-order effectful programming languages. The notion of sound limit doctrine has been used to classify accessible categories. We provide a definition of Lawvere theory that is enriched in a closed category that is locally presentable with respect to ...
متن کاملWhat is a Categorical Model of Arrows?
We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long been folklore that Arrows, a functional programming construct, and Freyd categories, a categorical notion due to Power, Robinson and Thielecke, are somehow equivalent. In this paper, we show that the situation is more subtle. By considering Arrows wholly within the base category we derive two altern...
متن کاملGeneric models for computational effects
AFreyd-category is a subtle generalisation of the notion of a categorywith finite products. It is suitable formodelling environments in call-by-value programming languages, such as the computational -calculus, with computational effects.We develop the theory of Freyd-categorieswith that inmind.Wefirst show that any countable Lawvere theory, hence any signature of operationswith countable arity ...
متن کاملModelling environments in call-by-value programming languages
In categorical semantics, there have traditionally been two approaches to modelling environments, one by use of finite products in cartesian closed categories, the other by use of the base categories of indexed categories with structure. Each requires modifications in order to account for environments in call-by-value programming languages. There have been two more general definitions along bot...
متن کاملChu connections and back diagonals between $\mathcal{Q}$-distributors
Chu connections and back diagonals are introduced as morphisms for distributors between categories enriched in a small quantaloid Q. These constructions, meaningful for closed bicategories, are dual to that of arrow categories and the Freyd completion of categories. It is shown that, for a small quantaloid Q, the category of complete Q-categories and left adjoints is a retract of the dual of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999